Direct calculation of sensitivity to the coefficients of the basic submatrix in parametric linear programming
نویسندگان
چکیده
— Thîs paper demonsîrates a meîhodfor direct catculation of sensitimties with respect to coefficients in the constraints ofa linear program. Sensitivity coefficients are derivedfor both marginal changes andfinite changes in one or a group ofconstraïnt coefficients corresponding to basîc variables. An examplû of application is given in tkefieîd ofpower jlow anaïysis with changing aâmittance in a meshed electric power transmission and génération System. Another application for paramétrée anaïysis in the modeling of the eniîre energy sector is discussed, Keywords; Ünear programming, sensitivity, constraint coefficients, direct method. Résumé. — Au terme d'un bref développement mathématique, une formule simple est donnée pour le calcul direct du changement de la valeur optimale de lafonction'Objectifd'un programme linéaire pour un changement infinitésimal donné à un ou plusieurs coefficients des contraintes, lorsque ces coefficients multiplient des variables appartenant à la base optimale du programme linéaire. Cette formule utilise exclusivement les valeurs optimales des variables primates et duales du problème. Une seconde formule est donnée pour le calcul direct du changement de la valeur optimale de ta fonction-objectif lorsque les changements aux coefficients des contraintes ont une valeur non infinitésimale mais finie. Mots clés : programmation linéaire, sensibilité, coefficients des contraintes^ méthode directe.
منابع مشابه
SENSITIVITY ANALYSIS IN LINEAR-PLUS-LINEAR FRACTIONAL PROGRAMMING PROBLEMS
In this paper, we study the classical sensitivity analysis when the right - hand – side vector, and the coefficients of the objective function are allowed to vary.
متن کاملA Survey on Different Solution Concepts in Multiobjective Linear Programming Problems with Interval Coefficients
Optimization problems have dedicated a branch of research to themselves for a long time ago. In this field, multiobjective programming has special importance. Since in most real-world multiobjective programming problems the possibility of determining the coefficients certainly is not existed, multiobjective linear programming problems with interval coefficients are investigated in this paper. C...
متن کاملFuzzy linear regression model with crisp coefficients: A goal programming approach
The fuzzy linear regression model with fuzzy input-output data andcrisp coefficients is studied in this paper. A linear programmingmodel based on goal programming is proposed to calculate theregression coefficients. In contrast with most of the previous works, theproposed model takes into account the centers of fuzzy data as animportant feature as well as their spreads in the procedure ofconstr...
متن کاملSome Duality Results in Grey Linear Programming Problem
Different approaches are presented to address the uncertainty of data and appropriate description of uncertain parameters of linear programming models. One of them is to use the grey systems theory in modeling such problem. Especially, recently, grey linear programming has attracted many researchers. In this paper, a kind of linear programming with grey coefficients is discussed. Introducing th...
متن کاملFlux Distribution in Bacillus subtilis: Inspection on Plurality of Optimal Solutions
Linear programming problems with alternate solutions are challenging due to the choice of multiple strategiesresulting in the same optimal value of the objective function. However, searching for these solutions is atedious task, especially when using mixed integer linear programming (MILP), as previously applied tometabolic models. Therefore, judgment on plurality of optimal m...
متن کامل